Downlink Performance of Superimposed Pilots in Massive MIMO systems

In this paper, we investigate the downlink throughput performance of a massive multiple-input multiple-output (MIMO) system that employs superimposed pilots for channel estimation. The component of downlink (DL) interference that results from transmitting data alongside pilots in the uplink (UL) is shown to decrease at a rate proportional to the square root of the number of antennas at the BS. The normalized mean-squared error (NMSE) of the channel estimate is compared with the Bayesian Cram\'{e}r-Rao lower bound that is derived for the system, and the former is also shown to diminish with increasing number of antennas at the base station (BS). Furthermore, we show that staggered pilots are a particular case of superimposed pilots and offer the downlink throughput of superimposed pilots while retaining the UL spectral and energy efficiency of regular pilots. We also extend the framework for designing a hybrid system, consisting of users that transmit either regular or superimposed pilots, to minimize both the UL and DL interference. The improved NMSE and DL rates of the channel estimator based on superimposed pilots are demonstrated by means of simulations.Comment: 28 single-column pages, 6 figures, 1 table, Submitted to IEEE Trans. Wireless Commun. in Aug 2017. Revised Submission in Feb. 201

Statistical Mechanics Approach to Sparse Noise Denoising

Reconstruction fidelity of sparse signals contaminated by sparse noise is considered. Statistical mechanics inspired tools are used to show that the l1-norm based convex optimization algorithm exhibits a phase transition between the possibility of perfect and imperfect reconstruction. Conditions characterizing this threshold are derived and the mean square error of the estimate is obtained for the case when perfect reconstruction is not possible. Detailed calculations are provided to expose the mathematical tools to a wide audience.Comment: 5 pages, 2 figures; Special session: "Trends in Sparse Signal Processing: Theory and Algorithm Design", Eusipco 201

Analysis of Regularized LS Reconstruction and Random Matrix Ensembles in Compressed Sensing

Performance of regularized least-squares estimation in noisy compressed sensing is analyzed in the limit when the dimensions of the measurement matrix grow large. The sensing matrix is considered to be from a class of random ensembles that encloses as special cases standard Gaussian, row-orthogonal, geometric and so-called T-orthogonal constructions. Source vectors that have non-uniform sparsity are included in the system model. Regularization based on l1-norm and leading to LASSO estimation, or basis pursuit denoising, is given the main emphasis in the analysis. Extensions to l2-norm and "zero-norm" regularization are also briefly discussed. The analysis is carried out using the replica method in conjunction with some novel matrix integration results. Numerical experiments for LASSO are provided to verify the accuracy of the analytical results. The numerical experiments show that for noisy compressed sensing, the standard Gaussian ensemble is a suboptimal choice for the measurement matrix. Orthogonal constructions provide a superior performance in all considered scenarios and are easier to implement in practical applications. It is also discovered that for non-uniform sparsity patterns the T-orthogonal matrices can further improve the mean square error behavior of the reconstruction when the noise level is not too high. However, as the additive noise becomes more prominent in the system, the simple row-orthogonal measurement matrix appears to be the best choice out of the considered ensembles

Transceiver Design for Data Rate Maximization of MIMO SWIPT System Based on Generalized Triangular Decomposition

In this paper, we investigate a new approach for simultaneous wireless information and power transfer (SWIPT) in point-To-point multiple-input multiple-output (MIMO) system with spatial switching (SS) reception. The new approach is based on the generalized triangular decomposition (GTD). The approach takes advantage of the GTD structure to allow the transmitter to use the strongest subchannel jointly for energy harvesting and information exchange while these transmissions can be separated at the receiver to comply with the SS system requirements. An optimal solution is developed in the paper for SWIPT based on GTD that jointly obtains the optimal subchannels assignment and maximizes the total data rate while meeting the minimum requirement of the harvested energy with limited total transmitted power. The theoretical and numerical results presented in this paper show that the proposed approach significantly outperforms the state of the art spatial domain SWIPT systems based on the singular value decomposition (SVD)